Sample Path Large Deviations for Queueing Networks with Bernoulli Routing
نویسنده
چکیده
This paper is devoted to the problem of sample path large deviations for multidimensional queueing models with feedback. We derive a new version of the contraction principle where the continuous map is not well-defined on the whole space: we give conditions under which it allows to identify the rate function. We illustrate our technique by deriving a large deviation principle for a class of networks that contains the classical Jackson networks.
منابع مشابه
Sample path large deviations and intree networks
Using the contraction principle, in this paper we derive a set of closure properties for sample path large deviations. These properties include sum, reduction, composition and reeection mapping. Using these properties, we show that the exponential decay rates of the steady state queue length distributions in an intree network with routing can be derived by a set of recursive equations. The solu...
متن کاملSample Path Large Deviations for Multiclass Feedforward Queueing Networks in Critical Loading
We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from cumulative arrival and service time processes which are assumed to satisfy an appropriate sample path large deviation principle. We establish logarithmic asympto...
متن کاملOn Large Deviations in Load Sharing Networks1
Three policies, namely Optimal Repacking, Least Load Routing, and Bernoulli Splitting, are considered for dynamic resource allocation in load sharing networks with standard Erlang type statistics. Large deviations principles are established for the three policies in a simple network of three consumer types and two resource locations, and are used to identify the network overrow exponents. The o...
متن کاملOn Large Deviations in Load Sharing Networks
Three policies, namely optimal repacking, least load routing, and Bernoulli splitting, are considered for dynamic resource allocation in load sharing networks with standard Erlang type statistics. Large deviations principles are established for the three policies in a simple network of three consumer types and two resource locations and are used to identify the network overflow exponents. The o...
متن کاملLarge Deviations and the Generalized Processor Sharing Scheduling for a Two-Queue System
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed communication networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006